Out of Order Dram Sequencer

ABSTRACT

Memory access requests are successively received in a memory request queue of a memory controller. Any conflicts or potential delays between temporally proximate requests that would occur if the memory access requests were to be executed in the received order are detected, and the received order of the memory access requests is rearranged to avoid or minimize the conflicts or delays and to optimize the flow of data to and from the memory data bus. The memory access requests are executed in the reordered sequence, while the originally received order of the requests is tracked. After execution, data read from the memory device by the execution of the read-type memory access requests are transferred to the respective requestors in the order in which the read requests were originally received.

FIELD OF THE INVENTION

This application is a continuation of U.S. patent application Ser. No.11/604,906 (now allowed), filed Nov. 28, 2006, which is a continuationof U.S. patent application Ser. No. 10/143,896, filed May 14, 2002, nowU.S. Pat. No. 7,149,857, the entireties of which are hereby incorporatedby reference.

The present invention relates to the architecture and operational methodof a memory controller for controlling memory access operations toachieve an increased effective memory bandwidth.

BACKGROUND OF THE INVENTION

In most computer or data processing systems, the main active memory, orrandom access memory (RAM), is a dynamic random access memory (DRAM).The structure of a DRAM is generally composed of a number of memorycells organized into a plurality of banks. Each bank corresponds to anarray of the memory cells with each cell being respectively associatedwith a unique memory address. In particular, memory addresses within abank are each designated by a row address and a column address, whereineach row address is defined as a memory page. Each page of memory,therefore, contains several memory locations corresponding to thedifferent column designations within the page.

When performing a series of access requests, if a currently requestedpage is found in a same bank currently having another page open, suchcondition is known as a “page conflict,” whereupon the previously openedpage must first be closed, or “precharged.” After precharging, therequested page may then be opened, or “activated,” and then the read orwrite operation is performed. A “page miss” occurs if the currentlyrequested page is found in a bank which has no page open, thus requiringan activation procedure to be performed. A “page hit” is said to occurwhen a current memory access request is for a page which is already openfrom a previous memory access request.

Due to the extra processing which must be performed for page conflictand page miss memory accesses relative to page hit requests, the timeneeded to perform the former two processes is significantly greater thanfor the latter. In early stages of microprocessor technologydevelopment, requests to access a DRAM memory page, for both read andwrite operations, were received and fulfilled on a first in, first outbasis. Such processing tends to be very inefficient, resulting in alarge number of page misses and conflicts, and thus requiring anextensive dedication of processor and/or memory controller resources toprecharging and activating memory pages.

More recently, more advanced processing methods have been developed inwhich memory access is based on priority. The priority of the accessrequest may be based on various factors such as the type of devicesending the request, the type of access requested, the memory addressdesired to be accessed by the request, etc. The problem with providingmemory access strictly on priority, however, is that low priorityrequests may be denied access for unacceptably long periods of time.

Moreover, as each new generation of computers evolves, memory clockspeeds, are increased significantly. As the speed of a memory's clockincreases, the potential occurrences of and the time penalty for pagemiss memory operations, bank busy conflicts, and other conflicts alsobecome increasingly significant. In particular, the data bus used totransfer information to and from each accessed memory location is idleduring precharging, activating, waiting for bank availability, etc.

A solution is therefore needed to mitigate the drawbacks discussedabove. In particular, memory processing efficiency would be greatlyimproved if the order of a sequence of received memory access requestscould be rearranged to avoid or reduce conflicts. By avoiding orreducing conflicts, the memory data bus is more efficiently utilized inthat idle time in the memory data bus is reduced or eliminated, whichthereby effectively increases the memory bandwith of the memory systemand enables more memory access transactions to occur in a shorter amountof time than previously possible.

BRIEF SUMMARY OF THE INVENTION

The present invention seeks to address the problems identified in theprior art by rearranging the sequentially received order of DRAM accessrequests to minimize conflicts and delays such as those discussed above,while returning the requested information to requesting units in thesame order in which the requests were originally received.

In the present invention, memory access requests are successivelyreceived in an input queue of a memory controller. A sequence matrix isarranged after the request input queue, whereupon conflicts or potentialdelays between sequential requests are identified by a conflictdetector. The conflict detector re-orders the memory core accessrequests to optimize the flow of data to and from the data bus. Forexample, if a bank busy condition or other delay is recognized by theconflict detector in the sequentially received memory requests, thememory controller rearranges the order in which the pending memoryrequests will be executed to eliminate the conflict or delay, ifpossible, or otherwise to minimize the delay.

Write requests can also be executed out of order as long as there are noaddressing conflicts with earlier requests.

The re-ordered sequence is retained in an execution queue, wherein eachrequest is tagged to indicate its location in the original sequence sothat returned data can be properly re-ordered in the memory controllerto match the order of the incoming memory access requests.

A command selector selects a command or commands to be executed from theexecution queue. The command selector contains interface timingcharacteristics which enables a constant speed DRAM sequencer tointerface with multiple clock speeds without complicated clock phasingoperations.

A read return queue tracks the returned data obtained from the DRAM.Based on the tag associated with each returned data, the read returnqueue returns the read data to the respective requestors in the originalsequential order. Specifically, upon executing a read request, if thetag associated with the returned data corresponds with the read requesthaving the longest latency in the memory controller, the returned datais returned to the system unit which requested the data. If the tag isnot associated with the read request having the longest latency, thereturned data is stored in a buffer until returned data for all readrequests having a longer latency are returned to their respectiverequestors.

Alternatively, each request can be assigned a buffer location based onthe received request sequence. When returned data obtained from the DRAMis placed into the buffer location corresponding to the read requestreceived earliest in the input queue, that data is returned to theappropriate requestor. Otherwise, the returned data is retained in thebuffer until all prior read requests as received in the input queue havebeen executed. In this manner, the read return queue returns data fromthe buffer locations in the order in which they were originallyreceived.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, aspects, and advantages of the present invention willbecome apparent from the following detailed description of a preferredembodiment of the invention, described with reference to theaccompanying drawings, wherein:

FIG. 1 is a block diagram of a memory controller in accordance with thepresent invention;

FIG. 2 is a flowchart illustrating the process for returning requesteddata obtained by the re-ordered execution of read requests to theirrespective requestors in the originally received order of the requests.

FIG. 3 is a first embodiment of a conflict re-ordering process performedby the sequence load logic unit in the memory controller upon detectionof a conflict or delay in a current timing matrix;

FIG. 4 is a second embodiment of a conflict re-ordering processperformed by the sequence load logic unit in the memory controller upondetection of a conflict or delay in a current timing matrix;

FIG. 5 is a third embodiment of a conflict re-ordering process performedby the sequence load logic unit in the memory controller upon detectionof a conflict or delay in a current timing matrix;

FIG. 6 is a timing diagram for illustrating the operation of the presentinvention.

FIG. 7 is a block diagram of a processing system in which the memorycontroller of the present invention may be utilized.

DETAILED DESCRIPTION OF THE INVENTION

For ease of description, the preferred embodiments of the presentinvention are discussed below as being used in conjunction with dynamicrandom access memory (DRAM) devices. Nevertheless, it should beunderstood that the present invention is not limited to applicationsinvolving DRAM. Rather, it is emphasized that the memory controller andmethods of the present invention may be used in conjunction with othertypes of random access memories, such as static RAMs (SRAM) and the manydifferent subspecies of DRAMs, including, for example, fast page modeDRAM (FPM DRAM), extended data out DRAM (EDO DRAM), burst EDO DRAM,synchronous DRAM (SDRAM), double data rate DRAM (DDR DRAM), Rambus DRAM(RDRAM), etc.

FIG. 1 shows a memory controller 10 in accordance with the presentinvention, and which includes an input queue 12, a command parser 14, asequencing unit 16, a sequence matrix 18, a conflict detector 20, acommand sequencer 22, an execution queue 24, a command selector 26, aninput/output buffer 28, a read return queue 30, and a returned databuffer 32.

Memory access requests enter the memory controller 10 and are receivedin input queue 12 on a first-in first-out basis. The received requestsare then sequentially processed by command parser 14 to obtain relevantinformation from each request signal, such as memory address (MA) data,a chip select (CS) command (indicating a requested memory bank to beaccessed), a row address select (RAS) command, and a column addressselect (CAS) command, and a write enable (WE) state for indicatingwhether the request is a read or a write operation.

The information obtained is then provided to the sequencing unit 16,which places the received memory access requests into a sequence matrix18 in accordance with a clock signal received in the sequence matrix 18.It is noted that upon startup of the process, the access requests areloaded into the matrix in the order in which they are received in thesequencing unit 16.

Conflict detector 20 monitors the information in the sequence matrix 18and checks for any conflicts or delays that may occur if the sequence ofrequests in the matrix were to be executed in the current order in thesequence matrix. Any conflict or delay detected by conflict detector 20is reported back to sequencing unit 16, which then rearranges the orderof the requests in the matrix to minimize or eliminate the time thememory data bus is idle due to the identified conflicts or delays.Conflicts which may be detected by conflict detector 20 include, but arenot limited to, page conflicts and bank busy conditions in which amemory bank is busy performing another read or write operation, forexample. Delays identified by the conflict detector are conditionswhich, while not necessarily a conflict with the execution of anothermemory access request, would require the performance of preparatorysteps during which time the memory data bus is idle. Such delaysinclude, for example, page conflicts, page misses, etc.

Generally, both read and write type memory access requests may bere-ordered in the sequence matrix 18. However, it is preferable thatwrite requests only be rearranged if necessary to the extent that there-ordered sequence does not create any addressing conflicts withearlier received requests in to the input queue or otherwise interferewith the data stored or to be stored in the relevant memory locations inconnection with any other memory access requests in the matrix.

As additional memory access requests are moved into the sequence matrix18, while also being rearranged to resolve conflicts or reduce delays bysequencing unit 16, the requests at the front of the sequence are movedinto the execution queue 24, which serves as a transfer buffer where therearranged requests await execution. Depending on the conflictresolution process used in the sequencing unit 16, the requests may bemoved into the execution queue 24 either on a continuous basis inaccordance with a clock signal, in batches of a predetermined number ofaccess requests, or based on a predetermined cumulative size of therequests. Preferably, the clock (CLK) for the execution queue 24 is thesame clock (CLK) guiding the loading of sequence matrix 18.

Command sequencer 22 arranges the various commands associated with eachrequest transferred to execution queue 24 from the sequence matrix 18,as it may be necessary to insert and/or temporally separate data controlcommands from the read or write command of a particular memory accessrequest. For example, if a read or write request sent to execution queue24 requires a precharging and/or activation operation, a data controlcommand to initiate the precharging and/or activation operation isplaced in the execution queue ahead of the relevant read or writeoperation, with at least one other read or write command associated witha different access request positioned between the precharge and/oractivate command and the associated read or write command.

An advantage of the present invention is realized by separating the reador write commands from such data control commands in this manner.Specifically, in the above example, the precharge and/or activationoperation in the above example can be performed while the read or writecommand for another memory access request can be immediately executed.Thus, the memory data bus does not have to be idle during the time thepre-charge and/or activation operation is performed.

When each read request is transferred to the execution queue, a tag istemporarily added to the data control commands for that request, foridentifying the original relative placement of the each request asreceived in the input queue 12. Alternatively, each read request may beassigned a respective buffer location in a read buffer 32, which will bedescribed in more detail later.

In accordance with a command select clock (CMD CLK) signal fed intocommand selector 26, one or more memory access requests from the frontof the execution queue 24 is (are) selected for execution in theappropriate DRAM bank(s). For example, if the command select clocksignal is four times the speed of the clock speed at which requests areloaded into sequence matrix 18, then four access requests are removedfrom execution queue 24 for each clock signal of queue 24. In this case,command selector 26 regulates the request selection process so that thefour access requests which are all selected at one time from queue 24are executed at even intervals. If the commands are selected from theexecution queue for execution at the same clock speed at which newrequests are entered into the sequence matrix 18, then command selector26 may be omitted from memory controller 10.

I/O buffer 28 is a transition buffer used during the read or writeoperation specified in each access request. If a current access requestto be executed is a write operation, the data to be written into theselected memory cell is temporarily written into I/O buffer 28.Similarly, data read from a selected memory cell in a read operation istemporarily stored in I/O buffer 28.

Upon execution of the requested memory access, each read request isplaced into a read return queue 30. Read return queue 30 manages therequested data read from the DRAM upon execution of the read requests,and returns the requested data to the respective requestors in the orderin which they were received in the input queue. Data read from the DRAMis either transferred directly to the requestor or is placed intoreturned data buffer 32, depending on the tag or assigned bufferlocation associated with the returned request data.

Referring now to FIG. 2, after executing a read request, the executedread request is returned to the read request queue 30, with the dataobtained by the request being temporarily held in I/O buffer 28 (step100). If the read request queue 30 determines at step 110 that thereturning read request is associated with the most current tag orassigned buffer location, the data obtained by that request is returnedto the requestor at step 120, and the current tag/buffer locationinformation is updated at step 130.

A tag or buffer location is “current” if it is assigned to or associatedwith the read request having the longest latency in the memorycontroller 10. Read return queue 30 may keep track of the most currenttag or buffer location, for example, by incrementing a count value whichrepresents the current tag or buffer location each time a returned datais transferred to its requestor.

If the returning read request has a tag or an assigned buffer locationwhich is not current, the data is placed into the read data buffer 32(step 140) until the associated tag or buffer location becomes current.After placing the returned data into the buffer 32 in step 140 or afterupdating the current tag or buffer location in step 130, the read returnqueue 30 determines whether or not returned data corresponding to thecurrent tag or buffer location can be found in the returned data buffer32. If “yes,” the process returns to step 120, where the currentreturned data is transferred to the requestor of that data, and thecurrent tag or buffer location is again updated in step 130. If returneddata corresponding to the current tag or buffer location is not found inthe buffer 32, the process returns to step 100 to receive the returneddata obtained by the execution of the next read request in the executionqueue. Due to this process shown in FIG. 2, the read data is returned tothe respective requestors in the order in which the requests werereceived into the input queue 12.

If tags are used to indicate the originally received order of the readrequests, the tags are temporarily inserted among the data controlcommands of each request, but are not included in the read data returnedto the requestors. Preferably, the functions of the read return queue 30and of the returned data buffer 32 are performed according to a clockspeed corresponding to the clock speed of the DRAM or an integralmultiple thereof. As such, returned read requests and returned datareceived in the read return queue 30 and returned data buffer 32 can becoordinated with the updating of the current tag/buffer location and thetransferring of the returned data, respectively.

A first embodiment of a conflict re-ordering process which thesequencing unit 16 may use to reschedule a memory access request due toa detected conflict or delay will be described with reference to theflowchart shown in FIG. 3 At step 200, the last memory access request tobe parsed is placed in the sequence matrix 18. At step 210, the statusof the memory bank desired to be accessed is checked to determine if anyconflicts or delays would occur if the newly arrived memory accessrequest is executed at its present position in the sequence matrix 18.

If sequencing unit 16 detects a conflict or delay with respect to thenewly arrived request, sequencing unit 16 determines at step 240 whethera more suitable timing position can be found among the sequence ofmemory access requests ahead of its current position. Specifically,sequencing unit 16 first determines whether any unresolved conflicts ordelays are present in the sequence ahead of the new access request, andif so, whether or not the new access request can be performed duringthat time without conflict. If there are no pending conflicts or delays,sequencing unit 16 checks whether the new access request may berescheduled at any point in the matrix without causing any new conflictsor delays among the previously scheduled requests. If not, the processis redirected to step 230, whereupon the new access request is left atthe end of the current timing sequence with the unresolved condition. Ifa suitable timing position can be found ahead in the sequence, the newlyarrived request is inserted into sequence at that position (step 250).The process is than returned to step 200 to be repeated for the nextincoming memory access request.

If, on the other hand, no conflict or delay is detected with respect tothe newly arrived access request, the conflict detector 20 nextdetermines at step 220 whether any unresolved conflicts or delays arepresent in the timing matrix ahead of the current position of the newlyarrived request. If an unresolved conflict or delay is found, theprocess is redirected to step 240 discussed above. If no existingconflicts are found, the sequencing unit 16 leaves the request in itscurrent position in sequence matrix 18 at step 230, and then returns tostep 200 to repeat the process for the next incoming memory accessrequest.

In this embodiment, any unresolved conflicts or delays may or may not belater resolved with the arrival of a new access request with asubsequent iteration of the sequencing unit 16. If no suitable requestarrives to alleviate the conflict or delay, the memory access requestswill continue to be processed in the designated order, but there will besome inefficiency in utilization of the memory data bus line due to theunresolved conflict(s) or unmitigated delay(s).

A second embodiment of the conflict re-ordering process performed bysequencing unit 16 is illustrated in the flowchart shown in FIG. 4. Asanother memory access request is moved out of the sequence matrix 18 tothe execution queue 24, the access request next in line in the sequencematrix is moved into the first location of the sequence matrix at step300. At step 310, conflict detector 20 determines whether a conflict ordelay is present with respect to the access request at the head of thesequence matrix (i.e., the earliest one in among the requests in thematrix). If no conflict is found, the access request is passed onto theexecution queue 24 at step 320, and the process returns to step 300.

On the other hand, if a conflict or delay is detected in step 310, theconflict detector 20 turns its attention to the next access request inthe sequence matrix, and determines at step 330 whether or not thatrequest can be performed at that time position without any conflicts. Ifno conflicts or delays would be created by scheduling that accessrequest at that time position, the request is sent to the executionqueue 24 at step 320, and the process returns to step 300. If a conflictor delay is found, the process repeats step 330 until a request is foundwhich may be suitably executed at that time position.

In this embodiment, if a conflict or delay is found to exist withrespect to the memory access of the request at the head of the sequencematrix, and any subsequent requests, the rejected requests remain intheir current position in the sequence until a suitable time slot isfound for the request. With this process, no memory access will be sentto the execution queue 24 with a conflict or delay condition. Also, eachrequest is given priority based on latency, and will be executed at theearliest possible time slot in which no conflict condition is created bythe timing of that request.

A variation of the embodiment discussed above with reference to FIG. 4is shown in FIG. 5, wherein if a conflict or delay is found with respectto the current timing position of the access request at the head of thesequence matrix, the offending request is sent to the back of thesequence, rather than being left in the sequence at its currentlocation. Specifically, if a conflict is found at step 310, step 420 isexecuted in which the request having the conflict or delay is sent tothe back of the sequence. Then, conflict detector 20 moves to the nextaccess request in line to determine if any conflicts or delays are foundwith respect to that request (step 430). If no conflicts or delays aredetected, the request is sent to the execution queue 24, similarly tothe process shown in FIG. 4. If a conflict or delay is detected, theprocess returns to step 420.

Referring now to FIG. 6, a timing chart is shown illustrating the resultobtained upon the operation of the present invention. In this example,read requests RD₀, RD₁, and RD₂ are received in the input queue in theorder as listed. Assume that a page conflict condition has been detectedwith respect to RD₀, and that RD₁ and RD₂ are both page hits in othermemory banks. Because a delay would have resulted if RD₀ were allowed toexecute to completion before RD₁ and RD₂, the requests have beenrearranged so that while the precharge operation is being performed forRD° , read memory accesses for RD₁ and RD₂ are executed. Rearranging thecommands in this manner minimizes the time that the memory data buswould have been idle while waiting for the precharge operation for RD₀to finish executing, thus resulting in a more efficient utilization ofthe memory data bus.

After the data for RD₁ and RD ₂ have been read from the DRAM, theactivation operation for RD₀ is performed, and then the read accesscommand for RD₀ is performed. The read data “1111” and “2222” aretransferred to the returned data buffer in the order the read operationsare executed. After the “0000” data is obtained from the appropriatememory cell, however, the data is returned first to the requestor ofRD₀. Then, the data “1111” and “2222” are returned to their respectiverequestors, in that order.

FIG. 7 illustrates an exemplary processing system 900 which may utilizethe memory controller 10 of the present invention. The processing system900 includes one or more processors 901 coupled to a local bus 904.Memory controller 10 and a primary bus bridge 903 are also coupled thelocal bus 904. The processing system 900 may include multiple memorycontrollers 10 and/or multiple primary bus bridges 903. The memorycontroller 10 and the primary bus bridge 903 may be integrated as asingle device 906.

The memory controller 10 is also coupled to one or more memory databuses 907. Each memory bus accepts memory components 908 which includeat least one memory device 902. The memory components 908 may be formedas a memory card or a memory module. Examples of memory modules usablein the system 900 include single inline memory modules (SIMMs) and dualinline memory modules (DIMMs). The memory components 908 may include oneor more additional devices 909. For example, in a SIMM or DIMM, theadditional device 909 might be a configuration memory, such as a serialpresence detect (SPD) memory.

The memory controller 10 may also be coupled to a cache memory 905. Thecache memory 905 may be the only cache memory in the processing system.Alternatively, other devices, for example, processors 901 may alsoinclude cache memories, which may form a cache hierarchy with cachememory 905. If the processing system 900 includes peripherals orcontrollers which are bus masters or which support direct memory access(DMA), the memory controller 10 may implement a cache coherencyprotocol. If the memory controller 10 is coupled to a plurality ofmemory buses 907, each memory bus 907 may be operated in parallel, ordifferent address ranges may be mapped to different memory buses 907.

The primary bus bridge 903 is coupled to at least one peripheral bus910. Various devices, such as peripherals or additional bus bridges maybe coupled to the peripheral bus 910. These devices may include astorage controller 911, a miscellaneous I/O device 914, a secondary busbridge 915, a multimedia processor 918, and a legacy device interface920. The primary bus bridge 903 may also be coupled to one or morespecial purpose high speed ports 922. In a personal computer, forexample, the special purpose port might be the Accelerated Graphics Port(AGP), used to couple a high performance video card to the processingsystem 900.

The storage controller 911 couples one or more storage devices 913, viaa storage bus 912, to the peripheral bus 910. For example, the storagecontroller 911 may be a SCSI controller and storage devices 913 may beSCSI discs. The I/O device 914 may be any sort of peripheral. Forexample, the I/O device 914 may be a local area network interface, suchas an Ethernet card. The secondary bus bridge may be used to interfaceadditional devices via another bus to the processing system. Forexample, the secondary bus bridge may be a universal serial port (USB)controller used to couple USB devices 917 via the processing system 900.The multimedia processor 918 may be a sound card, a video capture card,or any other type of media interface, which may also be coupled toadditional devices such as speakers 919. The legacy device interface 920is used to couple legacy devices, for example, older styled keyboardsand mice, to the processing system 900.

The processing system 900 illustrated in FIG. 7 is only an exemplaryprocessing system with which the invention may be used. While FIG. 7illustrates a processing architecture especially suitable for a generalpurpose computer, such as a personal computer or a workstation, itshould be recognized that well known modifications can be made toconfigure the processing system 900 to become more suitable for use in avariety of applications. For example, many electronic devices whichrequire processing may be implemented using a simpler architecture whichrelies on a CPU 901 coupled to memory components 908 and/or memorydevices 902. These electronic devices may include, but are not limitedto audio/video processors and recorders, gaming consoles, digitaltelevision sets, wired or wireless telephones, navigation devices(including systems based on the global positioning system (GPS) and/orinertial navigation), and digital cameras and/or recorders. Themodifications may include, for example, elimination of unnecessarycomponents, addition of specialized devices or circuits, and/orintegration of a plurality of devices.

Although the present invention has been described in relation toparticular embodiments thereof, many other variations and modificationsand other uses will become apparent to those skilled in the art. It ispreferred, therefore, that the present invention be limited not by thespecific disclosure herein, but only by the appended claims.

1.-61. (canceled)
 62. A method for controlling memory access operations,comprising: receiving a plurality of memory access requests in areceived sequence, each one of the plurality of memory access requestscomprising a data control command and a read or write command; detectingmemory access conflicts or delays among temporally proximate requests inthe sequence by comparing one of the plurality of non-executed memoryaccess requests with a different one of the plurality of non-executedmemory access request; and rearranging the sequence of requests based onthe detection result such that a first data control command for a firstrequest is executed while or before a second read or write command froma second request is executed.
 63. The method according to claim 62,further comprising executing the rearranged sequence of requests. 64.The method according to claim 63, further comprising: keeping track ofthe received sequence of memory access requests after execution; andtransferring to respective requestors, requested data obtained byexecution of read requests in the rearranged sequence, wherein therequested data is transferred to the respective requestors in an ordercorresponding to the received sequence of the respective read requests.65. The method according to claim 64, wherein keeping track of thereceived sequence includes, after rearranging the sequence of requests,associating a tag with each read request to indicate the sequence inwhich the read requests were originally received.
 66. The methodaccording to claim 62, wherein the step of detecting is performed todetect whether a conflict would be created upon executing the mostrecently received memory access request in its current position in thereceived sequence.
 67. The method according to claim 62, wherein thestep of rearranging is performed to minimize a delay which would becaused by waiting for a memory bank to become available for accessduring a detected bank busy conflict.
 68. The method according to claim62, wherein the step of detecting is performed to detect whether a pageconflict would be created upon executing the most recently receivedmemory access request in its current position in the received sequence.69. A method for controlling memory access, comprising: receiving aplurality of memory access requests in an received sequence, each one ofthe plurality of memory access requests comprising a data controlcommand and a read or write command; separating a first data controlcommand from a first read or write command of a first memory accessrequest, the first memory access request being one of the plurality ofmemory access requests in the sequence; executing the separated firstdata control command before or while a second read or write command froma second memory access request from the plurality of memory accessrequest is executed, wherein the second memory access request is aheadof the first memory access request in the received sequence; andexecuting the first read or write command after the second read or writecommand has executed.
 70. The method according to claim 69, wherein thestep of rearranging is performed to minimize a delay which would becaused by waiting for a memory bank to become available for accessduring a detected bank busy conflict or to detect whether a pageconflict would be created upon executing the most recently receivedmemory access request in its current position in the received sequence.71. The method according to claim 69, further comprising: detectingmemory access conflicts or delays among temporally proximate requests inthe sequence by comparing one of the plurality of non-executed memoryaccess requests with a different one of the plurality of non-executedmemory access request.
 72. The method according to claim 71, wherein thestep of detecting is performed to detect whether a conflict would becreated upon executing the most recently received memory access requestin its current position in the received sequence.
 73. A method forsequencing memory access request, comprising: receiving a plurality ofmemory access requests in a sequenced order in a sequence matrix;detecting whether a first conflict or delay would occur among theplurality of memory access request, the first conflict or delay arisingfrom a comparison of a first non-executed memory access request of theplurality of requests with a second non-executed memory access requestof the plurality of requests; and arranging an execution order in thesequence matrix based on detected memory access conflicts or delays,wherein at least one of said plurality of memory access requests in thesequence matrix is arranged by being moved back or ahead in the sequencematrix.
 74. The method according to claim 73, wherein if the firstconflict or delay is detected with respect to the first memory accessrequest in the sequenced order and the first memory access request islast in the sequence matrix, the step of rearranging includes moving thelatest received memory access request to a first position to resolve aunresolved conflict or delay in the sequence.
 75. The method accordingto claim 74, wherein if there is no unresolved conflict or delay in thesequence, the step of rearranging includes moving the latest memoryaccess request to a second position so as to not create a secondconflict or delay in the sequence.
 76. The method according to claim 75,wherein if the first conflict or delay is detected with respect to afirst non-executed memory access request in the sequenced order and thefirst memory access request is the earliest received request in thesequence matrix, the step of rearranging includes selecting a thirdreceived memory access request to move to the beginning of the sequence.77. The method according to claim 76, wherein the third received memoryrequest is selected by determining the earliest received request of saidplurality of requests that resolves the first conflict.
 78. The methodaccording to claim 73, wherein if the first conflict or delay isdetected with respect to a first non-executed memory access request inthe sequenced order and the first memory access request is the earliestreceived request in the sequence matrix, the step of rearrangingincludes moving the first memory access request to the back of thesequence.
 79. The method according to claim 73, wherein the step ofrearranging is performed to minimize a delay which would be caused bywaiting for a memory bank to become available for access during adetected bank busy conflict or to detect whether a page conflict wouldbe created upon executing the most recently received memory accessrequest in its current position in the received sequence.
 80. The methodaccording to claim 73, further comprising executing the rearrangedsequence of request.
 81. The method according to claim 73, furthercomprising: keeping track of the received sequence of memory accessrequests after execution; and transferring to respective requestors,requested data obtained by execution of read requests in the rearrangedsequence, wherein the requested data is transferred to the respectiverequestors in an order corresponding to the received sequence of therespective read requests.